A nearly perfect sphere

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Nearly Perfect Market?

Internet shopbots allow consumers to almost instantly compare prices and other characteristics from dozens of sellers via a single website. We estimate the magnitude of consumer search costs and benefits using data from a major shopbot for books. For the median consumer, the estimated benefit from simply scrolling down to search lower screens is $6.55. This amounts to about 60% of the observed ...

متن کامل

Graphene: a nearly perfect fluid.

Hydrodynamics and collision-dominated transport are crucial to understand the slow dynamics of many correlated quantum liquids. The ratio eta/s of the shear viscosity eta to the entropy density s is uniquely suited to determine how strongly the excitations in a quantum fluid interact. We determine eta/s in clean undoped graphene using a quantum kinetic theory. As a result of the quantum critica...

متن کامل

Nearly perfect fluidity

Shear viscosity is a measure of the amount of dissipation in a simple fluid. In kinetic theory shear viscosity is related to the rate of momentum transport by quasi-particles, and the uncertainty relation suggests that the ratio of shear viscosity η to entropy density s in units of h̄/kB is bounded by a constant. Here, h̄ is Planck’s constant and kB is Boltzmann’s constant. A specific bound has b...

متن کامل

SINEs of a nearly perfect character.

Mobile elements have been recognized as powerful tools for phylogenetic and population-level analyses. However, issues regarding potential sources of homoplasy and other misleading events have been raised. We have collected available data for all phylogenetic and population level studies of primates utilizing Alu insertion data and examined them for potentially homoplasious and other misleading...

متن کامل

Nearly perfect sets in graphs

In a graph G = (V; E), a set of vertices S is nearly perfect if every vertex in V ? S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and eecient dominating sets. We say a nearly perfect set S is 1-minimal if for every vertex u in S, the set S ? fug is not nearly perfect. Similarly, a nearly perfect s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dentofacial Anomalies and Orthodontics

سال: 2013

ISSN: 2110-5715

DOI: 10.1051/odfen/2013309